See googolplexplexplex on Wiktionary
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "googolplexplex",
"3": "plex"
},
"expansion": "googolplexplex + -plex",
"name": "suffix"
}
],
"etymology_text": "From googolplexplex + -plex.",
"head_templates": [
{
"args": {
"1": "?"
},
"expansion": "googolplexplexplex",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "num",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "English terms suffixed with -plex",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
}
],
"examples": [
{
"bold_text_offsets": [
[
94,
112
],
[
167,
185
],
[
196,
214
]
],
"ref": "1990, Gary Noland, Teatime in Purgatory: For Narrator, Piano Improviser, and Pantomimists: Opus 16, Berkeley, Calif.: Freeland Publications, →OCLC, pages 27–28:",
"text": "Thereupon, we shall label the number designated by a one followed by googolplexplex zeros as \"googolplexplexplex,\" and then the number designated by a one followed by googolplexplexplex zeros as \"googolplexplexplexplex,\" and so on, until we've added googolplex \"plexes\" to our original \"googol,\" a number that (for lack of anything else coming to mind) we'll name after this author, hence: [\"]Nolandplex.\"",
"type": "quotation"
},
{
"bold_text_offsets": [
[
315,
333
]
],
"ref": "2000 August 7, Gerry Quinn, “Simple (?) probability problem”, in rec.puzzles (Usenet), archived from the original on 30 Dec 2025:",
"text": "But the math is very nice and simple when you accept my claim! On the other hand, if I accept your claim it becomes quite horrific. Let's take the value g to represent the probability that the number will be between 1/googolplexplex and googolplexplex. What is the chance that it will be between googolplexplex and googolplexplexplex (a much larger range)? Greater or lesser than g? How soon before your totals add up to more than 1?",
"type": "quotation"
},
{
"bold_text_offsets": [
[
335,
353
],
[
361,
379
],
[
409,
427
],
[
434,
452
]
],
"ref": "2010 February 10, “To Infinity and Beyond...”, in Horizon, season 46, episode 12, spoken by Steven Berkoff, London: BBC Television, →ISBN, →OCLC:",
"text": "One, two, three... four, five, six... seven, eight, nine... […] For most people, I suppose the biggest number they’ll likely meet will be somewhere in the billions or maybe the trillions, which might be something like the budget deficit or military spending or something like that. Mathematicians tend to use bigger numbers than that. Googolplexplexplex three, googolplexplexplex four... You made me do this! Googolplexplexplex five, googolplexplexplex six... When I get to 199, then that would be too hard, I would have to stop.",
"type": "quotation"
},
{
"bold_text_offsets": [
[
65,
83
],
[
115,
133
]
],
"ref": "2020 September 8, Jim Burns, “Arbitrariness in set theory: \"Every\" is not \"all\".”, in sci.logic (Usenet), archived from the original on 30 Dec 2025:",
"text": "If omega were a reallyreallyreallybig but finite number, such as googolplexplexplex, the sequence would end before googolplexplexplex, it would have an immediate predecessor, you could step to it, though only in principle. All the properties you have insisted that omega must have, on pain of being found inconsistent. But that's not what omega is.",
"type": "quotation"
}
],
"glosses": [
"The number 10 raised to the power of one googolplexplex."
],
"id": "en-googolplexplexplex-en-num-PCVyF9Oa",
"links": [
[
"googolplexplex",
"googolplexplex"
]
],
"raw_glosses": [
"(rare) The number 10 raised to the power of one googolplexplex."
],
"synonyms": [
{
"word": "googoltriplex"
}
],
"tags": [
"rare"
]
}
],
"word": "googolplexplexplex"
}
{
"etymology_templates": [
{
"args": {
"1": "en",
"2": "googolplexplex",
"3": "plex"
},
"expansion": "googolplexplex + -plex",
"name": "suffix"
}
],
"etymology_text": "From googolplexplex + -plex.",
"head_templates": [
{
"args": {
"1": "?"
},
"expansion": "googolplexplexplex",
"name": "en-noun"
}
],
"lang": "English",
"lang_code": "en",
"pos": "num",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English lemmas",
"English nouns",
"English nouns with unknown or uncertain plurals",
"English terms suffixed with -plex",
"English terms with quotations",
"English terms with rare senses",
"Pages with 1 entry",
"Pages with entries"
],
"examples": [
{
"bold_text_offsets": [
[
94,
112
],
[
167,
185
],
[
196,
214
]
],
"ref": "1990, Gary Noland, Teatime in Purgatory: For Narrator, Piano Improviser, and Pantomimists: Opus 16, Berkeley, Calif.: Freeland Publications, →OCLC, pages 27–28:",
"text": "Thereupon, we shall label the number designated by a one followed by googolplexplex zeros as \"googolplexplexplex,\" and then the number designated by a one followed by googolplexplexplex zeros as \"googolplexplexplexplex,\" and so on, until we've added googolplex \"plexes\" to our original \"googol,\" a number that (for lack of anything else coming to mind) we'll name after this author, hence: [\"]Nolandplex.\"",
"type": "quotation"
},
{
"bold_text_offsets": [
[
315,
333
]
],
"ref": "2000 August 7, Gerry Quinn, “Simple (?) probability problem”, in rec.puzzles (Usenet), archived from the original on 30 Dec 2025:",
"text": "But the math is very nice and simple when you accept my claim! On the other hand, if I accept your claim it becomes quite horrific. Let's take the value g to represent the probability that the number will be between 1/googolplexplex and googolplexplex. What is the chance that it will be between googolplexplex and googolplexplexplex (a much larger range)? Greater or lesser than g? How soon before your totals add up to more than 1?",
"type": "quotation"
},
{
"bold_text_offsets": [
[
335,
353
],
[
361,
379
],
[
409,
427
],
[
434,
452
]
],
"ref": "2010 February 10, “To Infinity and Beyond...”, in Horizon, season 46, episode 12, spoken by Steven Berkoff, London: BBC Television, →ISBN, →OCLC:",
"text": "One, two, three... four, five, six... seven, eight, nine... […] For most people, I suppose the biggest number they’ll likely meet will be somewhere in the billions or maybe the trillions, which might be something like the budget deficit or military spending or something like that. Mathematicians tend to use bigger numbers than that. Googolplexplexplex three, googolplexplexplex four... You made me do this! Googolplexplexplex five, googolplexplexplex six... When I get to 199, then that would be too hard, I would have to stop.",
"type": "quotation"
},
{
"bold_text_offsets": [
[
65,
83
],
[
115,
133
]
],
"ref": "2020 September 8, Jim Burns, “Arbitrariness in set theory: \"Every\" is not \"all\".”, in sci.logic (Usenet), archived from the original on 30 Dec 2025:",
"text": "If omega were a reallyreallyreallybig but finite number, such as googolplexplexplex, the sequence would end before googolplexplexplex, it would have an immediate predecessor, you could step to it, though only in principle. All the properties you have insisted that omega must have, on pain of being found inconsistent. But that's not what omega is.",
"type": "quotation"
}
],
"glosses": [
"The number 10 raised to the power of one googolplexplex."
],
"links": [
[
"googolplexplex",
"googolplexplex"
]
],
"raw_glosses": [
"(rare) The number 10 raised to the power of one googolplexplex."
],
"synonyms": [
{
"word": "googoltriplex"
}
],
"tags": [
"rare"
]
}
],
"word": "googolplexplexplex"
}
Download raw JSONL data for googolplexplexplex meaning in All languages combined (3.6kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2026-01-03 from the enwiktionary dump dated 2026-01-01 using wiktextract (96027d6 and 9905b1f). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.